Ackermann functions and transfinite ordinals

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some New Properties of Transfinite Ordinals

1 Presented to the Society, December 27, 1939. The author is indebted to Professor W. A. Hurwitz for his indispensable advice in the preparation of this paper. 2 W. Sierpinski, Leçons sur les Nombres Transfinis, Paris, 1928, p. 202; hereafter referred to as Sierpinski (I). The theorem was first stated for ordinals of the first and second ordinal class by G. Cantor, Beitrdge zur Begründung der t...

متن کامل

Transfinite Ordinals in Recursive Number Theory

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Arithmetical transfinite induction and hierarchies of functions

We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris–Harrington Theorem, and a version of the Solovay–Ketonen Theorem. We give uniform proofs using combinatorial constructions.

متن کامل

Using Transfinite Ordinal Conditional Functions

Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this frame...

متن کامل

Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1

We describe a comprehensive HOL mechanisation of the theory of ordinal numbers, focusing on the basic arithmetic operations. Mechanised results include the existence of fixpoints such as ε0, the existence of normal forms, and the validation of algorithms used in the ACL2 theorem-proving system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1995

ISSN: 0893-9659

DOI: 10.1016/0893-9659(95)00084-4